Problem:
 f(c(s(x),y)) -> f(c(x,s(y)))
 g(c(x,s(y))) -> g(c(s(x),y))
 g(s(f(x))) -> g(f(x))

Proof:
 Bounds Processor:
  bound: 1
  enrichment: match
  automaton:
   final states: {4,3}
   transitions:
    g1(9) -> 4*
    c1(7,1) -> 9*
    c1(2,7) -> 8*
    c1(1,7) -> 8*
    c1(7,2) -> 9*
    s1(7) -> 7*
    s1(2) -> 7*
    s1(1) -> 7*
    f1(8) -> 3*
    f0(2) -> 3*
    f0(1) -> 3*
    c0(1,2) -> 1*
    c0(2,1) -> 1*
    c0(1,1) -> 1*
    c0(2,2) -> 1*
    s0(2) -> 2*
    s0(1) -> 2*
    g0(2) -> 4*
    g0(1) -> 4*
  problem:
   
  Qed